Normal Form


Q41.

Given the following relation instance. \begin{array}{|l|l|l|}\hline \text{X} & \text{Y} & \text{Z} \\\hline \text{1} & \text{4} & \text{2} \\ \text{1} & \text{5} & \text{3} \\ \text{1} & \text{6} & \text{3} \\ \text{3} & \text{2} & \text{2} \\\hline \end{array}Which of the following functional dependencies are satisfied by the instance?
GateOverflow

Q42.

Consider the schema R=(S,T, U, V) and the dependencies S \rightarrow T, T \rightarrow U, U \rightarrow V and V \rightarrow S. Let R = (R1\text{ and } R2) be a decomposition such that R1 \cap R2 \neq \phi. The decomposition is
GateOverflow

Q43.

Relation R with an associated set of functional dependencies, F , is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is.
GateOverflow

Q44.

R,(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition ?
GateOverflow

Q45.

Choose the correct alternatives (More than one may be correct).Indicate which of the following statements are true: A relational database which is in 3NF may still have undesirable data redundancy because there may exist:
GateOverflow

Q46.

For a database relation R(a, b, c, d), where the domains a, b, c, d include only atomic values, only the following functional dependencies and those that can be inferred from them hold a \rightarrow c b \rightarrow d This relation is
GateOverflow

Q47.

Which normal form is considered adequate for normal relational database design?
GateOverflow